Thermodynamic graph-rewriting

Thermodynamic Graph-Rewriting

We develop a new thermodynamic approach to stochastic graph-rewriting. The ingredients are a finite set of reversible graph-rewriting rules G (called generating rules), a finite set of connected graphs P (called energy patterns), and an energy cost function which associates real values to each of these energy patterns. The idea is that G defines the qualitative dynamics, by showing which transf...

Term Graph Rewriting and Parallel Term Rewriting

The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain cycles, then one term graph reduction may correspond to infinitely many term reductions. We stress that this fact can be interpreted in two ways. According to the ...

Transitive Term Graph Rewriting

A version of generalised term graph rewriting is presented in which redirections are interpreted transitively. It is shown that the new semantics enjoy enhanced properties regarding ease of implementation on distributed machines compared with conventional semantics because of the Church-Rosser properties of transitive redirections. Furthermore, the good properties of orthogonal systems are larg...

Pragmatic Graph Rewriting Modifications

Graph Rewriting and Constraint

In this extended abstract we describe our approach to modelling the dynamics of distributed systems. For distributed systems we mean systems consisting of concurrent processes communicating via shared ports and posing certain synchronization requirements, via the ports, to the adjacent processes. We use graphs to represent states of such systems , and graph rewriting to represent their evolutio...